A The Ordering Principle in a Fragment of Approximate Counting
نویسندگان
چکیده
The ordering principle states that every finite linear order has a least element. We show that, in the relativized setting, the surjective weak pigeonhole principle for polynomial time functions does not prove a Herbrandized version of the ordering principle over T 2 . This answers an open question raised in [Buss, Ko lodziejczyk and Thapen, 2012] and completes their program to compare the strength of Jeřábek’s bounded arithmetic theory for approximate counting with weakened versions of it.
منابع مشابه
Fragments of Approximate Counting
We study the long-standing open problem of giving ∀Σ1 separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the ∀Σ1 Herbrandized ordering principle is unprovable in a fragment of bounded arithmet...
متن کاملOptimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملPeriodic Oscillations in the Analysis of Algorithms and Their Cancellations
A large number of results in analysis of algorithms contain fluctuations. A typical result might read “The expected number of . . . for large n behaves like log2 n + constant + delta(log2 n), where delta(x) is a periodic function of period one and mean zero.” Examples include various trie parameters, approximate counting, probabilistic counting, radix exchange sort, leader election, skip lists,...
متن کاملAn approximate model for slug flow heat transfer in channels of arbitrary cross section
In this paper, a novel approximate solution to determine the Nusselt number for thermally developed, slug (low-prandtl), laminar, single phase flow in channels of arbitrary cross section is presented. Using the Saint-Venant principle in torsion of beams, it is shown that the thermally developed Nusselt number for low-prandtl flow is only a function of the geometrical parameters of the channel c...
متن کاملApproximate counting by hashing in bounded arithmetic
We show how to formalize approximate counting via hash functions in subsystems of bounded arithmetic, using variants of the weak pigeonhole principle. We discuss several applications, including a proof of the tournament principle, and an improvement on the known relationship of the collapse of the bounded arithmetic hierarchy to the collapse of the polynomial-time hierarchy.
متن کامل